On eulerian and regular perfect path double covers of graphs
نویسندگان
چکیده
منابع مشابه
On eulerian and regular perfect path double covers of graphs
A perfect path double cover (PPDC) of a graph G is a family P of paths of G such that every edge of G belongs to exactly two paths of P and each vertex of G occurs exactly twice as an endpoint of a path in P. Li (J. Graph Theory 14 (1990) 645–650) has shown that every simple graph has a PPDC.A regular perfect path double cover (RPPDC) of a graph G is a PPDC of G in which all paths are of the sa...
متن کاملPath decompositions and perfect path double covers
We consider edge-decompositions of regular graphs into isomorphic paths. An m-PPD (perfect path decomposition) is a decomposition of a graph into paths of length m such that every vertex is an end of exactly two paths. An m-PPDC (perfect path double cover) is a covering of the edges by paths of length m such that every edge is covered exactly two times and every vertex is an end of exactly two ...
متن کاملDistance-Regular Graphs with bt=1 and Antipodal Double-Covers
Throughout this paper, we assume 1 is a connected finite undirected graph without loops or multiple edges. We identify 1 with the set of vertices. For vertices : and ; in 1, let (:, ;) denote the distance between : and ; in 1, that is, the length of a shortest path connecting : and ;. Let d=d(1 ) denote the diameter of 1, that is, the maximal distance between any two vertices in 1. Let 1i (:)=[...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملGeneral Cyclic Orthogonal Double Covers of Finite Regular Circulant Graphs
An orthogonal double cover (ODC) of a graph H is a collection ( ) { } v G v V H : = ∈ of ( ) V H subgraphs (pages) of H, so that they cover every edge of H twice and the intersection of any two of them contains exactly one edge. An ODC of H is cyclic (CODC) if the cyclic group of order ( ) V H is a subgroup of the automorphism group of . In this paper, we introduce a general orthogonal la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.08.038